The rank of a distributive lattice

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Total graph of a $0$-distributive lattice

Let £ be a $0$-distributive lattice with the least element $0$, the greatest element $1$, and ${rm Z}(£)$ its set of zero-divisors. In this paper, we introduce the total graph of £, denoted by ${rm T}(G (£))$. It is the graph with all elements of £ as vertices, and for distinct $x, y in £$, the vertices $x$ and $y$ are adjacent if and only if $x vee y in {rm Z}(£)$. The basic properties of the ...

متن کامل

Weakly submodular rank functions, supermatroids, and the flat lattice of a distributive supermatroid

Distributive supermatroids generalize matroids to partially ordered sets. Completing earlier work of Barnabei, Nicoletti and Pezzoli we characterize the lattice of flats of a distributive supermatroid. For the prominent special case of a polymatroid the description of the flat lattice is particularly simple. Large portions of the proofs reduce to properties of weakly submodular rank functions. ...

متن کامل

Distributive Lattice-Structured Ontologies

In this paper we describe a language and method for deriving ontologies and ordering databases. The ontological structures arrived at are distributive lattices with attribution operations that preserve ∨, ∧ and ⊥. The preservation of ∧ allows the attributes to model the natural join operation in databases. We start by introducing ontological frameworks and knowledge bases and define the notion ...

متن کامل

Reimer's Inequality on a Finite Distributive Lattice

We generalize Reimer’s Inequality [6] (a.k.a the BKR Inequality or the van den Berg–Kesten Conjecture [1]) to the setting of finite distributive lattices. (MSC 60C05)

متن کامل

The Set of Super-stable Marriages Forms a Distributive Lattice

Relaxing the total orders of the preference lists of an instance of the stable marriage problem to arbitrary pose& we show after adjusting the notion of stability to the new problem that the set of stable marriages still forms a distributive lattice.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1979

ISSN: 0012-365X

DOI: 10.1016/0012-365x(79)90082-7